Cone types and geodesic languages for lamplighter groups and Thompson’s group F
نویسندگان
چکیده
We study languages of geodesics in lamplighter groups and Thompson’s group F . We show that the lamplighter groups Ln have infinitely many cone types, have no regular geodesic languages, and have 1-counter, context-free and counter geodesic languages with respect to certain generating sets. We show that the full language of geodesics with respect to one generating set for the lamplighter group is not counter but is context-free, while with respect to another generating set the full language of geodesics is counter and context-free. In Thompson’s group F with respect to the standard finite generating set, we show there are infinitely many cone types and that there is no regular language of geodesics. We show that the existence of families of “seesaw” elements with respect to a given generating set in a finitely generated infinite group precludes a regular language of geodesics and guarantees infinitely many cone types with respect to that generating set.
منابع مشابه
Cone Types and Geodesic Languages for Lamplighter Groups and Thompson’s Group F Sean Cleary, Murray Elder, and Jennifer Taback
We study languages of geodesics in lamplighter groups and Thompson’s group F . We show that the lamplighter groups Ln have infinitely many cone types, have no regular geodesic languages, and have 1-counter, context-free and counter geodesic languages with respect to certain generating sets. We show that the full language of geodesics with respect to one generating set for the lamplighter group ...
متن کاملQuasi - Isometrically Embedded Subgroups of Thompson ’ S Group F 3
The goal of this paper is to construct quasi-isometrically embedded subgroups of Thompson’s group F which are isomorphic to F × Zn for all n. A result estimating the norm of an element of Thompson’s group is found. As a corollary, Thompson’s group is seen to be an example of a finitely presented group which has an infinite-dimensional asymptotic cone. The interesting properties of Thompson’s gr...
متن کاملSeesaw words in Thompson’s group F
We describe a family of words in Thompson’s group F which present a challenge to the question of finding canonical minimal length representatives, and which show that F is not combable by geodesics. These words have the property that there are only two possible suffixes of long lengths for geodesic paths to the word from the identity; one is of the form g and the other of the form g where g is ...
متن کاملThe Action of Thompson’s Group on a Cat(0) Boundary
For a given locally finite CAT(0) cubical complex X with base vertex ∗, we define the profile of a given geodesic ray c issuing from ∗ to be the collection of all hyperplanes (in the sense of [17]) crossed by c. We give necessary conditions for a collection of hyperplanes to form the profile of a geodesic ray, and conjecture that these conditions are also sufficient. We show that profiles in di...
متن کامل$\mathcal C$-graph automatic groups
We generalize the notion of a graph automatic group introduced by Kharlampovich, Khoussainov and Miasnikov by replacing the regular languages in their definition with more powerful language classes. For a fixed language class C, we call the resulting groups C-graph automatic. We prove that the class of C-graph automatic groups is closed under change of generating set, direct and free product fo...
متن کامل